Efficient Multi-Objective Optimization on Dynamic Flexible Job Shop Scheduling Using Deep Reinforcement Learning Approach

نویسندگان

چکیده

Previous research focuses on approaches of deep reinforcement learning (DRL) to optimize diverse types the single-objective dynamic flexible job shop scheduling problem (DFJSP), e.g., energy consumption, earliness and tardiness penalty machine utilization rate, which gain many improvements in terms objective metrics comparison with metaheuristic algorithms such as GA (genetic algorithm) dispatching rules MRT (most remaining time first). However, optimization floor cannot satisfy requirements modern smart manufacturing systems, multiple-objective DFJSP has become mainstream core intelligent workshops. A complex production environment a real-world factory causes entities have sophisticated characteristics, job’s non-uniform processing time, uncertainty operation number restraint due avoidance single machine’s prolonged slack well overweight load, make method combination DRL brought up adapt at different rescheduling points accumulate maximum rewards for global optimum. In our work, we apply structure dual layer DDQN (DLDDQN) solve real new arrivals, two objectives are optimized simultaneously, i.e., minimization delay sum makespan. The framework includes layers (agents): higher one is named goal selector, utilizes function approximator selecting reward form from six proposed ones that embody objectives, while lower one, called an actuator, decide optimal rule Q value. generated benchmark instances trained converged perfectly, comparative experiments validated superiority generality DLDDQN.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Flexible Job Shop Scheduling with Multi Objective Approach

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

متن کامل

Multi-Objective Flexible Job Shop Scheduling Optimization Models (II)

For the Multi-Objective Flexible Job Shop Scheduling Problems (MOFJSSP), various optimization models have been designed. In the first part of the research (published in no. 2/2012) we presented the multi-sort production systems, the theoretical aspects of MOFJSSP framework, a specific real JSS process in drugs industry based on over 600 tasks to be optimally scheduled (used as a case study for ...

متن کامل

Multi-Objective Flexible Job Shop Scheduling Optimization Models (I)

In manufacturing area, the most difficult problems related to the time-efficiency frequently occur if the jobs to be scheduled are heterogeneous, if there are alternative routes on the machines for the jobs and multiple objectives are imposed. This framework, named Multi-Objective Flexible Job Shop Scheduling Problems (MOFJSSP), has been formalized, modeled and studied in the last decades from ...

متن کامل

An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

متن کامل

Solving Flexible Job Shop Scheduling with Multi Objective Approach

In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Paretooptimal s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Processes

سال: 2023

ISSN: ['2227-9717']

DOI: https://doi.org/10.3390/pr11072018